Step of Proof: mul_cancel_in_lt
12,41
postcript
pdf
Inference at
*
I
of proof for Lemma
mul
cancel
in
lt
:
a
,
b
:
,
n
:
. ((
n
*
a
) < (
n
*
b
))
(
a
<
b
)
latex
by (Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)
latex
1
:
1:
1.
a
:
1:
2.
b
:
1:
3.
n
:
1:
4. (
n
*
a
) < (
n
*
b
)
1:
a
<
b
.
Definitions
,
t
T
,
P
Q
,
x
:
A
.
B
(
x
)
,
Lemmas
nat
plus
wf
origin